KERALA UNIVERSITY Class 8 graph theory Question Paper 2021

Practice authentic previous year questions for better exam preparation.

Sample Questions

What are the difficulties encountered in the theory of sequential machine? $$ \text { ( } 5 \times 4=20 \text { Marks) } $$ PART - B Answer any one questions from each Module. Each question carries 20 marks Module - I
Prove the following theorems (a) The total number of different, not edge disjoint, Hamiltonian circuits in a complete graph of n vertices is $(n-1)!/ 2$.
(b) Show a tree in which its diameter is not equal to twice the radius. Under what condition does this inequality hold? Elaborate.
(a) Write an algorithm to find a Hamiltonian path in a given undirected graph. 10
(b) How do you determine whether or not the two graph G1 and G2 are isomorphic? Explain with example. OR 2 11．（a）How do you generate the fundamental circuits in a given graph？illustrate the procedure with a suitable example．（b）Illustrate DFS algo...